Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes

Robust Parallel Adaptive Mesh Refinement Software Library for Unstructured Meshes

Parallel Refinement of Unstructured Meshes

In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement acros...

Parallel Algorithms for Adaptive Mesh Refinement

Computational methods based on the use of adaptively constructed nonuniform meshes reduce the amount of computation and storage necessary to perform many scientiic calculations. The adaptive construction of such nonuniform meshes is an important part of these methods. In this paper, we present a parallel algorithm for adaptive mesh reenement that is suitable for implementation on distributed-me...

Scalable parallel regridding algorithms for block-structured adaptive mesh refinement

Block-structured adaptive mesh refinement (BSAMR) is widely used within simulation software because it improves the utilization of computing resources by refining the mesh only where necessary. For BSAMR to scale onto existing petascale and eventually exascale computers all portions of the simulation need to weak scale ideally. Any portions of the simulation that do not will become a bottleneck...

Parallel Unstructured Mesh Partitioning